<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
            "http://www.w3.org/TR/REC-html40/loose.dtd">
<HTML>
<HEAD>



<META http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<META name="GENERATOR" content="hevea 1.08">
<LINK rel="stylesheet" type="text/css" href="tutorial.css">
<TITLE>
Tree Search Methods
</TITLE>
</HEAD>
<BODY >
<A HREF="tutorial079.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="index.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="tutorial091.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
<HR>

<H1 CLASS="chapter"><A NAME="htoc159">Chapter&nbsp;12</A>&nbsp;&nbsp;Tree Search Methods</H1>
<A NAME="chapsearch"></A>

<UL>
<LI><A HREF="tutorial087.html">Introduction</A>
<UL>
<LI><A HREF="tutorial087.html#toc75">Overview of Search Methods</A>
<LI><A HREF="tutorial087.html#toc76">Optimisation and Search</A>
<LI><A HREF="tutorial087.html#toc77">Heuristics</A>
</UL>
<LI><A HREF="tutorial088.html">Complete Tree Search with Heuristics</A>
<UL>
<LI><A HREF="tutorial088.html#toc78">Search Trees</A>
<LI><A HREF="tutorial088.html#toc79">Variable Selection</A>
<LI><A HREF="tutorial088.html#toc80">Value Selection</A>
<LI><A HREF="tutorial088.html#toc81">Example</A>
<LI><A HREF="tutorial088.html#toc82">Counting Backtracks</A>
</UL>
<LI><A HREF="tutorial089.html">Incomplete Tree Search</A>
<UL>
<LI><A HREF="tutorial089.html#toc83">First Solution</A>
<LI><A HREF="tutorial089.html#toc84">Bounded Backtrack Search</A>
<LI><A HREF="tutorial089.html#toc85">Depth Bounded Search</A>
<LI><A HREF="tutorial089.html#toc86">Credit Search</A>
<LI><A HREF="tutorial089.html#toc87">Timeout</A>
<LI><A HREF="tutorial089.html#toc88">Limited Discrepancy Search</A>
</UL>
<LI><A HREF="tutorial090.html">Exercises</A>
</UL>

<BR>
<BR>
<HR>
<A HREF="tutorial079.html"><IMG SRC ="previous_motif.gif" ALT="Previous"></A>
<A HREF="index.html"><IMG SRC ="contents_motif.gif" ALT="Up"></A>
<A HREF="tutorial091.html"><IMG SRC ="next_motif.gif" ALT="Next"></A>
</BODY>
</HTML>
